Equitable list point arboricity of graphs
نویسندگان
چکیده
منابع مشابه
Equitable list point arboricity of graphs
A graph G is list point k-arborable if, whenever we are given a k-list assignment L(v) of colors for each vertex v ∈ V(G), we can choose a color c(v) ∈ L(v) for each vertex v so that each color class induces an acyclic subgraph of G, and is equitable list point k-arborable if G is list point k-arborable and each color appears on at most ⌈|V(G)|/k⌉ vertices of G. In this paper, we conjecture tha...
متن کاملEquitable vertex arboricity of graphs
An equitable (t, k, d)-tree-coloring of a graph G is a coloring to vertices of G such that the sizes of any two color classes differ by at most one and the subgraph induced by each color class is a forest of maximum degree at most k and diameter at most d. The minimum t such that G has an equitable (t′, k, d)-tree-coloring for every t′ ≥ t is called the strong equitable (k, d)-vertex-arboricity...
متن کاملEquitable vertex arboricity of planar graphs
Let G1 be a planar graph such that all cycles of length at most 4 are independent and let G2 be a planar graph without 3-cycles and adjacent 4-cycles. It is proved that the set of vertices of G1 and G2 can be equitably partitioned into t subsets for every t ≥ 3 so that each subset induces a forest. These results partially confirm a conjecture of Wu, Zhang
متن کاملEquitable List Coloring of Graphs
A graph G is equitably k-choosable if, for any k-uniform list assignment L, G admits a proper coloring π such that π(v) ∈ L(v) for all v ∈ V (G) and each color appears on at most |G|/k vertices. It was conjectured in [8] that every graph G with maximum degree ∆ is equitably k-choosable whenever k ≥ ∆ + 1. We prove the conjecture for the following cases: (i) ∆ ≤ 3; (ii) k ≥ (∆ − 1). Moreover, eq...
متن کاملThe List Linear Arboricity of Planar Graphs
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. An and Wu introduce the notion of list linear arboricity lla(G) of a graph G and conjecture that lla(G) = la(G) for any graph G. We confirm that this conjecture is true for any planar graph having ∆ > 13, or for any planar graph with ∆ > 7 and without i-cycles for some i ∈ {3, 4, 5}....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2016
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1602373z